INTEGERS 11 A ( 2011 ) Proceedings of Integers Conference 2009 HEIGHTS OF DIVISORS OF X n − 1

نویسنده

  • Lola Thompson
چکیده

The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best possible upper bound of nψ(n) for almost all n, where ψ(n) is any function that approaches infinity as n → ∞. We will discuss the related problem of bounding the maximal height over all polynomial divisors of xn − 1 and give an analogue of Maier’s result in this scenario. – For my adviser Carl Pomerance on his 65th birthday

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

9 INTEGERS 11 A ( 2011 ) Proceedings of Integers Conference 2009

We study the question of whether for each n there is an m �= n with λ(m) = λ(n), where λ is Carmichael’s function. We give a “near” proof of the fact that this is the case unconditionally, and a complete conditional proof under the Extended Riemann Hypothesis. –To Professor Carl Pomerance on his 65th birthday

متن کامل

INTEGERS 11 A ( 2011 ) Proceedings of Integers Conference 2009 RECURSIVELY SELF - CONJUGATE PARTITIONS

A class of partitions that exhibit substantial symmetry, called recursively selfconjugate partitions, are defined and analyzed. They are found to have connections to non-squashing partitions and other combinatorial objects.

متن کامل

Integers Divisible by the Sum of Their Prime Factors

For each integer n 2, let β (n) be the sum of the distinct prime divisors of n and let B(x) stand for the set of composite integers n x such that n is a multiple of β (n). Upper and lower bounds are obtained for the cardinality of B(x). §

متن کامل

A GENERALIZATION OF A JACOBSON’S COMMUTATIVITY THEOREM

In this paper we study the structure and the commutativity of a ring R, in which for each x,y ? R, there exist two integers depending on x,y such that [x,y]k equals x n or y n.

متن کامل

Consecutive Integers with Equally Many Principal Divisors

Classifying the positive integers as primes, composites, and the unit, is so familiar that it seems inevitable. However, other classifications can bring interesting relationships to our attention. In that spirit, let us classify positive integers by the number of principal divisors they possess, where we define a principal divisor of a positive integer n to be any prime-power divisor pa|n which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011